Computational complexity of some restricted instances of 3-SAT
نویسندگان
چکیده
منابع مشابه
Computational complexity of some restricted instances of 3-SAT
Tovey [10] showed that it is NP-hard to decide the satisfiability of 3-SAT instances in which every variable occurs four times, while every instance of 3-SAT in which each variable occurs three times is satisfiable. We explore the border between these two problems. Answering a question of Iwama and Takaki, we show that, for every fixed k ≥ 0, there is a polynomial time algorithm to determine th...
متن کاملA Computational Proof of Complexity of Some Restricted Counting Problems
We explore a computational approach to proving the intractability of certain counting problems. These problems can be described in various ways, and they include concrete problems such as counting the number of vertex covers or independent sets for 3regular graphs. The high level principle of our approach is algebraic, which provides sufficient conditions for interpolation to succeed. Another a...
متن کاملSingle-solution Random 3-SAT Instances
We study a class of random 3-SAT instances having exactly one solution. The properties of this ensemble considerably differ from those of a random 3-SAT ensemble. It is numerically shown that the running time of several complete and stochastic local search algorithms monotonically increases as the clause density is decreased. Therefore, there is no easy-hard-easy pattern of hardness as for stan...
متن کاملSome Remarks on the Incompressibility of Width-Parameterized SAT Instances
Compressibility regards the reduction the length of the input, or of some other parameter, preserving the solution. Any 3-SAT instance on N variables can be represented by O(N) bits. [4] proved that the instance length in general cannot be compressed to O(N3−!) bits under the assumption NP !⊆ coNP/poly, which implies that the polynomial hierarchy collapses. This note initiates and puts forward ...
متن کاملSome Ideas on Random Generation of K-sat Instances
In our previous research work, we have studied the detection and the use of symmetries to improve the eeciency of satissability algorithms. We have believed that the most hard SAT problems present strucural properties such as symmetries. However, recently several authors have exhibited a threshold phenomena on randomly generated K-SAT instances. It is shown that hard instances can be generated ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2007
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.07.009